Bijection Between Increasing Binary Trees and Rook Placements on Double Staircases
نویسندگان
چکیده
In this paper, we shall construct a bijection between rook placements on double staircases (introduced by Josuat-Vergès in 2017) and increasing binary trees. We introduce two subclasses of staircases, which call left right-aligned placements. show that their enumeration, while keeping track certain statistic, gives the $\gamma$-vectors Eulerian polynomials. conclude with discussion different fits very well our main bijection, another generalising bijection. Our is special case due to Tewari (2019).
منابع مشابه
A Simple Bijection between Binary Trees and Colored Ternary Trees
In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.
متن کاملm-Level rook placements
Goldman, Joichi, and White proved a beautiful theorem showing that the falling factorial generating function for the rook numbers of a Ferrers board factors over the integers. Briggs and Remmel studied an analogue of rook placements where rows are replaced by sets of m rows called levels. They proved a version of the factorization theorem in that setting, but only for certain Ferrers boards. We...
متن کاملA bijection of plane increasing trees with relaxed binary trees of right height at most one
Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We construct a bijection between these two combinatorial objects and study the therefrom arising connections of certain parameters. Furthermore, we show central limit t...
متن کاملBijections on m-level rook placements
Suppose the rows of a board are partitioned into sets of m rows called levels. An m-level rook placement is a subset of the board where no two squares are in the same column or the same level. We construct explicit bijections to prove three theorems about such placements. We start with two bijections between Ferrers boards having the same number of m-level rook placements. The first generalizes...
متن کاملTwo vignettes on full rook placements
Using bijections between pattern-avoiding permutations and certain full rook placements on Ferrers boards, we give short proofs of two enumerative results. The first is a simplified enumeration of the 3124, 1234avoiding permutations, obtained recently by Callan via a complicated decomposition. The second is a streamlined bijection between 1342-avoiding permutations and permutations which can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2023
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10926